Simplifying and Generalizing Formulae in Tableaux. Pruning the Search Space and Building Models
نویسنده
چکیده
A powerful extension of the tableau method is described. It consists in a new simpliication rule allowing to prune the search space and a new way of extracting a model from a given (possibly innnite) branch. These features are combined with a former method for simultaneous search for refutations and models. The possibilities of the new method w.r.t. the original one are clearly stated. In particular it is shown that the method is able to build model for each formula having a model expressible by equational constraints.
منابع مشابه
Building models by using tableaux extended byequational problems
The problem of model construction is known to be a very important one. An extension of semantic tableaux (that can also be applied to the matings and to the connection method) allowing the building of models in a systematic way is presented. This approach is diierent from the usual one in semantic tableaux, in which model construction is a by-product of refutation failures (and this only in ver...
متن کاملSystem Description: The Tableaux Work Bench
The Tableaux Work Bench (TWB) is a meta tableau system designed for logicians with limited programming or automatic reasoning knowledge to experiment with new tableau calculi and new decision procedures. It has a simple interface, a history mechanism for controlling loops or pruning the search space, and modal simplification.
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملFinding Small High Performance Subsets of Induced Rule Sets: Extended Summary
Models consisting of decision rules – such as those produced by methods from Pawlak’s rough set theory – generally have a white-box nature, but in practice induced models are too large to be inspected. Here, we investigate methods for simplifying complex models while retaining predictive performance. The approach taken is rule filtering, i.e. post-pruning of complete rules. Two methods for find...
متن کاملA Pre xed Tableau Calculus for Plan Generation in Linear Temporal Logic
The search for nite models of temporal logic speci cations furnishes a logical though non deductive approch to planning that opens the way to the exploitation of method ologies and techniques from classical search based approaches such as plan space search regression and least commitment In this paper a tableau based decision procedure for nite satis ability of linear temporal formulae is prese...
متن کامل